在许多情况下，需要精确的机器人操纵任务（插入，拧紧，精确选择，精确选择）。以前的方法在此类操作任务上实现了良好的性能。但是，这种方法通常需要乏味的校准或昂贵的传感器。 3D/RGB-D摄像机和扭矩/力传感器增加了机器人应用的成本，并且可能并不总是经济的。在这项工作中，我们旨在解决这些问题，但仅使用弱化和低成本的网络摄像头。我们提出了双眼对准学习（BAL），可以自动学习眼手协调和点对准能力以解决这四个任务。我们的工作重点是与未知的眼睛协调合作，并提出了自动执行眼镜校准的不同方法。该算法在模拟中进行了训练，并使用实用管道实现SIM2Real并在真实机器人上进行测试。我们的方法在四个任务上成本最低，取得了竞争性的效果。

This paper investigates how hate speech varies in systematic ways according to the identities it targets. Across multiple hate speech datasets annotated for targeted identities, we find that classifiers trained on hate speech targeting specific identity groups struggle to generalize to other targeted identities. This provides empirical evidence for differences in hate speech by target identity; we then investigate which patterns structure this variation. We find that the targeted demographic category (e.g. gender/sexuality or race/ethnicity) appears to have a greater effect on the language of hate speech than does the relative social power of the targeted identity group. We also find that words associated with hate speech targeting specific identities often relate to stereotypes, histories of oppression, current social movements, and other social contexts specific to identities. These experiments suggest the importance of considering targeted identity, as well as the social contexts associated with these identities, in automated hate speech classification.

当机器学习（ML）模型提供其培训分配以外的数据时，他们更有可能做出不准确的预测。在网络物理系统（CPS）中，这可能导致灾难性系统故障。为了减轻这种风险，分布（OOD）检测器可以与ML模型和标志输入并行运行，这可能导致不良结果。尽管OOD探测器在准确性方面进行了很好的研究，但对资源约束CPS的部署的关注较少。在这项研究中，提出了一种设计方法来调整深入OOD检测器，以满足嵌入式应用的准确性和响应时间要求。该方法使用遗传算法来优化检测器的预处理管道，并选择一种平衡鲁棒性和响应时间的量化方法。它还标识了机器人操作系统（ROS）下的几个候选任务图，以部署所选设计。该方法在两个嵌入式平台的文献中的两个基于变异自动编码器的OOD检测器上进行了证明。提供了对设计过程中发生的权衡的洞察力，并表明这种设计方法可以导致相对于不居住的OOD检测器的响应时间急剧减少，同时保持可比较的精度。

机器学习（ML）研究通常集中在模型上，而最突出的数据集已用于日常的ML任务，而不考虑这些数据集对基本问题的广度，困难和忠诚。忽略数据集的基本重要性已引起了重大问题，该问题涉及现实世界中的数据级联以及数据集驱动标准的模型质量饱和，并阻碍了研究的增长。为了解决此问题，我们提出Dataperf，这是用于评估ML数据集和数据集工作算法的基准软件包。我们打算启用“数据棘轮”，其中培训集将有助于评估相同问题的测试集，反之亦然。这种反馈驱动的策略将产生一个良性的循环，该循环将加速以数据为中心的AI。MLCommons协会将维护Dataperf。

该摘要提出了一种探讨了在线政治战略游戏中多党话语中的检测和建模复杂社会现象的目标建模。我们开发了一种双层方法，首先将社会语言行为编码为语言特征，然后使用强化学习来估计任何玩家提供的优势。在第一层，社会语言行为（例如友谊和推理），即友谊和推理，用于影响他人的友谊和推理被编码为语言特征，以识别每个玩家在同时双方对话中应用的说服策略。在第二层中，加强学习方法用于估计图形感知奖励功能，以量化基于它们在该多群设置中的每个播放器提供的优势。我们将这种技术应用于游戏外交，使用了在78个用户之间交换了超过15,000个消息的数据集。与上下文 - 不可知的设置相比，我们的图形感知方法显示了强大的性能。

Tiktok是一个受欢迎的新社交媒体，用户通过短视频剪辑表达自己。平台上的常见互动形式参与了“挑战”，这是用户迭代的歌曲和舞蹈。挑战传染可以通过复制范围来衡量，即用户上传他们参与挑战的视频。 Tiktok平台的唯一性，其中挑战内容和用户偏好都在不断发展，需要挑战和用户表示的组合。本文通过预测用户的参与调查Tiktok挑战的社会传染。我们提出了一种新的深度学习模型，深度学习模型，学习和组合潜在的用户和挑战表格，以执行此用户挑战预测任务。我们从Fortoupage，App的登陆页面上的12个趋势挑战收集超过7,000个视频的数据集，从1303名用户提供超过10,000个视频。进行了广泛的实验，结果表明，我们所提出的Deepballenger（F1 = 0.494）在预测任务中优于基线（F1 = 0.188）。

Knowledge graph embedding (KGE), which maps entities and relations in a knowledge graph into continuous vector spaces, has achieved great success in predicting missing links in knowledge graphs. However, knowledge graphs often contain incomplete triples that are difficult to inductively infer by KGEs. To address this challenge, we resort to analogical inference and propose a novel and general self-supervised framework AnKGE to enhance KGE models with analogical inference capability. We propose an analogical object retriever that retrieves appropriate analogical objects from entity-level, relation-level, and triple-level. And in AnKGE, we train an analogy function for each level of analogical inference with the original element embedding from a well-trained KGE model as input, which outputs the analogical object embedding. In order to combine inductive inference capability from the original KGE model and analogical inference capability enhanced by AnKGE, we interpolate the analogy score with the base model score and introduce the adaptive weights in the score function for prediction. Through extensive experiments on FB15k-237 and WN18RR datasets, we show that AnKGE achieves competitive results on link prediction task and well performs analogical inference.

Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then conduct multi-modal interactions with query sentence for reasoning. However, we argue that these methods have overlooked two indispensable issues: 1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries. 2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model. To alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding. Extensive experiments demonstrate the effectiveness of SSRN on three challenging datasets.

Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for link prediction and have achieved state-of-the-art performance. Nevertheless, existing methods developed for this purpose are typically discriminative, computing features of local subgraphs around two neighboring nodes and predicting potential links between them from the perspective of subgraph classification. In this formalism, the selection of enclosing subgraphs and heuristic structural features for subgraph classification significantly affects the performance of the methods. To overcome this limitation, this paper proposes a novel and radically different link prediction algorithm based on the network reconstruction theory, called GraphLP. Instead of sampling positive and negative links and heuristically computing the features of their enclosing subgraphs, GraphLP utilizes the feature learning ability of deep-learning models to automatically extract the structural patterns of graphs for link prediction under the assumption that real-world graphs are not locally isolated. Moreover, GraphLP explores high-order connectivity patterns to utilize the hierarchical organizational structures of graphs for link prediction. Our experimental results on all common benchmark datasets from different applications demonstrate that the proposed method consistently outperforms other state-of-the-art methods. Unlike the discriminative neural network models used for link prediction, GraphLP is generative, which provides a new paradigm for neural-network-based link prediction.

Detecting abrupt changes in data distribution is one of the most significant tasks in streaming data analysis. Although many unsupervised Change-Point Detection (CPD) methods have been proposed recently to identify those changes, they still suffer from missing subtle changes, poor scalability, or/and sensitive to noise points. To meet these challenges, we are the first to generalise the CPD problem as a special case of the Change-Interval Detection (CID) problem. Then we propose a CID method, named iCID, based on a recent Isolation Distributional Kernel (IDK). iCID identifies the change interval if there is a high dissimilarity score between two non-homogeneous temporal adjacent intervals. The data-dependent property and finite feature map of IDK enabled iCID to efficiently identify various types of change points in data streams with the tolerance of noise points. Moreover, the proposed online and offline versions of iCID have the ability to optimise key parameter settings. The effectiveness and efficiency of iCID have been systematically verified on both synthetic and real-world datasets.